Impact of Multiple Consumption Channels on Wormhole Routed k-ary n-cube Networks
نویسندگان
چکیده
100 200 0 Throughput Latency do,1 do,2 do,4 pa,1 pa,2 pa,4 (a) do,1 do,2 do,4-6 pa,1 pa,2 pa,4-6
منابع مشابه
Alleviating Consumption Channel Bottleneck in Wormhole-Routed k-ary n-Cube Systems
This paper identiies performance degradation in wormhole routed k-ary n-cube networks due to limited number of router-to-processor consumption channels at each node. Many recent research in wormhole routing have advocated the advantages of adaptive routing and virtual channel ow control schemes to deliver better network performance. However, most of these results are based on innnite message co...
متن کاملFast Barrier Synchronization in Wormhole k-ary n-cube Networks with Multidestination Worms1
This paper presents a new approach to implement fast barrier synchronization in wormhole k-ary n-cubes. The novelty lies in using multidestination messages instead of the traditional single destination messages. Two diierent multidestination worm types, gather and broadcasting, are introduced to implement the report and wake-up phases of barrier synchronization , respectively. Algorithms for co...
متن کاملOptimal Phase Barrier Synchronization in K-ary N-cube Wormhole-routed Systems Using Multirendezvous Primitives
We propose a new multiphase barrier synchronization algorithm for k-ary n-cube networks using our earlier developed multirendezvous synchronization primitives 4]. The algorithm incurs minimal cost with optimal number of communication phases. The optimality is guided by system connguration parameters (k; n) and technological parameters t s (communication start-up cost) and t p (link-propagation ...
متن کاملMultidestination Message Passing in Wormhole K-ary N-cube Networks with Base Routing Conformed Paths 1
This paper proposes a novel concept of multidestination message passing mechanism for wormhole k-ary n-cube networks. Similar to the familiar car-pool concept, this mechanism allows data to be delivered to or picked-up from multiple nodes with a single message-passing step. Such messages can propagate along any valid path in a wormhole network conforming to the underlying base routing scheme (d...
متن کاملMultipath E-cube Algorithms (meca) for Adaptive Wormhole Routing and Broadcasting in K-ary N-cubes
This paper introduces and evaluates the Multipath E-Cube Algorithm (MECA) for adaptive and fault-tolerant wormhole routing in k-ary n-cubes. This algorithm provides multiple shortest paths between any source and destination node of a multicomputer using only a constant number of virtual channels for every physical channel, and with little added overhead at the router. Consequently, it is able t...
متن کامل